skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Creators/Authors contains: "Li, Zelong"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; ; ; ; ; ; (, Association for Computational Linguistics)
    Free, publicly-accessible full text available October 3, 2026
  2. ; ; ; ; ; ; (, Association for Computational Linguistics)
    Free, publicly-accessible full text available November 12, 2025
  3. ; ; ; (, The Electronic Journal of Combinatorics)
    The spread of a graph $$G$$ is the difference between the largest and smallest eigenvalue of the adjacency matrix of $$G$$. Gotshall, O'Brien and Tait conjectured that for sufficiently large $$n$$, the $$n$$-vertex outerplanar graph with maximum spread is the graph obtained by joining a vertex to a path on $n-1$ vertices. In this paper, we disprove this conjecture by showing that the extremal graph is the graph obtained by joining a vertex to a path on $$\lceil(2n-1)/3\rceil$$ vertices and $$\lfloor(n-2)/3\rfloor$$ isolated vertices. For planar graphs, we show that the extremal $$n$$-vertex planar graph attaining the maximum spread is the graph obtained by joining two nonadjacent vertices to a path on $$\lceil(2n-2)/3\rceil$$ vertices and $$\lfloor(n-4)/3\rfloor$$ isolated vertices. 
    more » « less
    Full Text Available 
  4. ; ; ; ; ; (, ACM)
    Full Text Available 
  5. ; ; ; ; ; ; (, Advances in Information Retrieval (ECIR 2024))
    Accepted Manuscript Full Text Available
  6. ; ; ; ; ; ; ; (, Advances in Neural Information Processing Systems 36 (NeurIPS 2023))
    Accepted Manuscript Full Text Available
  7. ; ; ; ; ; ; ; (, WSDM '23: Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining)
    Full Text Available 
  8. ; ; ; (, SIGIR '22: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval)
    Full Text Available 
  9. ; ; ; ; ; ; ; ; ; (, SIGIR '22: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval)
    Full Text Available 
  10. ; ; ; ; ; ; (, SIGIR '21: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval)
    null (Ed.)
    Full Text Available